Push-Pull Finite-Time Convergence Distributed Optimization Algorithm
نویسندگان
چکیده
منابع مشابه
A Push-Pull Gradient Method for Distributed Optimization in Networks
In this paper, we focus on solving a distributed convex optimization problem in a network, where each agent has its own convex cost function and the goal is to minimize the sum of the agents’ cost functions while obeying the network connectivity structure. In order to minimize the sum of the cost functions, we consider a new distributed gradient-based method where each node maintains two estima...
متن کاملA Real-Time Push-Pull Communications Model for Distributed Real-Time and Multimedia Systems
Real-time and multimedia applications like multi-party collaboration, internet telephony and distributed command control systems require the exchange of information over distributed and heterogeneous nodes. Multiple data types including voice, video, sensor data, real-time intelligence data and text are being transported widely across today's information, control and surveillance networks. All ...
متن کاملExperimental modeling and design optimization of push-pull electret loudspeakers.
A fully experimental modeling technique and a design optimization procedure are presented in this paper for push-pull electret loudspeakers. Conventional electrical impedance-based parameter identification methods are not completely applicable to electret speakers due to the extremely weak electromechanical coupling. This prompts the development of an experimental technique for identifying the ...
متن کاملPush and Pull Systems
Data broadcasting has emerged as an efficient way for the dissemination of information over asymmetric wireless environments where the needs of the various users of the data items are usually overlapping. In such environments, data broadcasting stands to be an efficient solution since the broadcast of a single information item is likely to satisfy a possibly large number of users. Communication...
متن کاملAdaptive Push-Then-Pull Gossip Algorithm for Scale-free Networks
Real life networks are generally modelled as scale-free networks. Information diffusion in such networks in decentralised environment is a difficult and resource consuming affair. Gossip algorithms have come up as a good solution to this problem. In this paper, we have proposed Adaptive First-Push-Then-Pull gossip algorithm. We show that algorithm works with minimum cost when the transition rou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Computational Mathematics
سال: 2020
ISSN: 2161-1203,2161-1211
DOI: 10.4236/ajcm.2020.101008